A Universal Reed-Solomon Decoder

نویسنده

  • Richard E. Blahut
چکیده

Two architecturesfor universal Reed-Solomon decoders are given. These decoders, called time-domain decoders, work directly on the raw data word as received without the usual syndrome calculation or power-sum-symmetric functions Up to the limitations of the working registers, the decoders can decode any Reed-Solomon codeword or BCH codeword in the presence of both errors and erasures. Provision is also made for decoding extended codes and shortened codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Universal VLSI Architecture for Reed-Solomon Error-and-Erasure Decoders

This paper presents a universal architecture for Reed–Solomon (RS) error-and-erasure decoder. In comparison with other reconfigurable RS decoders, our universal approach based on Montgomery multiplication algorithm can support not only arbitrary block length but various finite-field degree within different irreducible polynomials. Moreover, the decoder design also features the constant multipli...

متن کامل

Efficient Reed Solomon Decoder Based on pRiBM Algorithm for Effective Digital Signal Reception

In this paper, Reed Solomon (RS) decoder adopting the pipelined reduced inversion free Berlekamp Massey (pRiBM) algorithm is proposed. This Reed Solomon decoder is designed by equipping the Syndrome Computation unit, Key Equation Solver (KES), Chien search and Forney algorithm unit. The RS decoder requires long latency for decoding large number of test vectors. Therefore, the Reed Solomon decod...

متن کامل

Reed Solomon Decoder: TMS320C64x Implementation

This application report describes a Reed Solomon decoder implementation on the TMS320C64x DSP family. Reed Solomon codes have been widely accepted as the preferred (ECC) error control coding scheme for ADSL networks, digital cellular phones and high-definition television systems. The reason for their widespread prevalence is their excellent robustness to burst errors. Programmable implementati...

متن کامل

Modified time-domain algorithm for decoding Reed-Solomon codes

PRIMITIVE RS(n, k ) code with symbols from GF(2") A has codewords of length n = 2" 1. These codes can correct t = (n k)/2 symbol errors, with k information symbols. Time-domain decoding algorithms are attractive candidates for designing universal hardware RS decoders [l], [2 ] . A universal decoder can be used to decode any RS code with any block length and symbol alphabet, up to the limits of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IBM Journal of Research and Development

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1984